High-Resolution Signal Reconstruction Method Based on Sparse Structure Preservation
نویسندگان
چکیده
منابع مشابه
A Sparse Signal Reconstruction Method Based on Improved Double Chains Quantum Genetic Algorithm
This paper proposes a novel method of sparse signal reconstruction, which combines the improved double chains quantum genetic algorithm (DCQGA) and the orthogonal matching pursuit algorithm (OMP). Firstly, aiming at the problems of the slow convergence speed and poor robustness of traditional DCQGA, we propose an improved double chains quantum genetic algorithm (IDCQGA). The main innovations co...
متن کاملTight Frame Based Method for High-Resolution Image Reconstruction
High-resolution image reconstruction is to reconstruct a high-resolution (HR) image from multiple, undersampled, shifted, degraded and noisy frames obtained by using multiple images shifted from each other by sub-window shifts. Problems of high-resolution restoration for images arise in a variety of scientific, medical, and engineering applications. The problem of HR image reconstruction is bec...
متن کاملA New IRIS Segmentation Method Based on Sparse Representation
Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...
متن کاملA New IRIS Segmentation Method Based on Sparse Representation
Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...
متن کاملImproved Sparse Correspondence Resolution Using Loopy Belief Propagation with Mrf Clique Based Structure Preservation
In this paper we develop a novel MRF formulation for calculating sparse features correspondence in image pairs. Our MRF terms can include cliques of variable sizes, and solve these using Loopy Belief Propagation. To calculate our MRF topology we develop a variant of the K-means algorithm which we call the KN-means algorithm (where each mean has a specified number of neighbours). The method is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3021821